Computing Parameterized Invariants of Parameterized Petri Nets

Parameterized Reachability Trees for Algebraic Petri Nets

This paper is concerned with parameterized reachability trees, which have been proposed by M. Lindquist for predicate/transition nets. We discuss the application of this concept to algebraic nets. For this purpose a slight modification of several definitions is necessary due to the different net descriptions, transition rules and theoretical backgrounds. That’s why we present the whole concept ...

Parameterized Complexity Results for 1-safe Petri Nets

We associate a graph with a 1-safe Petri net and study the parameterized complexity of various problems with parameters derived from the graph. With treewidth as the parameter, we give W[1]-hardness results for many problems about 1-safe Petri nets. As a corollary, this proves a conjecture of Downey et. al. about the hardness of some graph pebbling problems. We consider the parameter benefit de...

Parameterized study of a Time Petri Net

Temporal analysis of Time Petri Nets encounters combinatory explosion. Most of actual works tackle with optimization and try to contain explosion. In in a di erent approach, this paper proposes a method allowing to study a part of a Time Petri Net de ned by a scenario. A scenario is an unordered set of transitions extracted from a Petri net. This scenario is analyzed by a logic process based on...

Implementation of Parameterized Petri NetClasses with the Petri Net Kernel ?

A parameterized liveness and ratio-enforcing supervisor for a class of generalized Petri nets

The work proposes a synthesis method of supervisors for flexible manufacturing systems modeled by a class of generalized Petri nets. A concept of resource usage ratios (RU-ratios) is first presented to describe the occupation degree of a resource by an operation. Next, an intrinsically live structure characterized by a special numerical relationship between arc-weights and initial markings is i...